A Dynamic Content Addressable
نویسندگان
چکیده
SbO state 0 X (don’t care 0 1 0 (zero) 1 0 1 (one) 1 not allowed Abstract A novel ternary dynamic content addressable memory cell with coupled match lines is presented here. The dynamic C A M cell contains only four n-type transistors. This cell is capable of storing and matching three states, hence the term ternary; these states are: zero (0), one (1) and don”t care (X) . Circuit simulations show that our dynamic CAM cell performs all the basic operations (read, write and match) at a good speed. In order t o use the proposed cell in a C A M array, we developed a cut-off scheme to deal with coupling.
منابع مشابه
Survey on Content Addressable Memory and Sparse Clustered Network
Most memory devices store and retrieve data by addressing specific memory locations. As a result, this path often becomes the limiting factor for systems that rely on fast memory accesses. The time required to find an item stored in memory can be reduced considerably if the item can be identified for access by its content rather than by its address. A memory that is accessed in this way is call...
متن کاملTransistor-Level Fault Analysis and Test Algorithm Development for Ternary Dynamic Content Addressable Memorie
Content addressable memories (CAMs) are gaining popularity with computer networks. Testing costs of CAMs are extremely high owing to their unique configuration. In this paper, we carried out a transistor-level fault analysis and devise a search path test algorithm. The proposed algorithm is of the order (nl / log2n) compared to the brute-force algorithm of complexity (nl). For the analyzed CAM,...
متن کاملDynamically Fault-Tolerant Content Addressable Networks
We describe a content addressable network which is robust in the face of massive adversarial attacks and in a highly dynamic environment. Our network is robust in the sense that at any time, an arbitrarily large fraction of the peers can reach an arbitrarily large fraction of the data items. The network can be created and maintained in a completely distributed fashion.
متن کاملA peer-to-peer network based on multi-mesh architecture
This paper presents the design and evaluation of a highly scalable, decentralized and self-organizing peer-topeer network architecture based on the multi-mesh topology. Our network automatically adapts to dynamic node arrivals, departures and failures. Each node maintains a fixed set of neighbor connections, regardless of the size of the network. This demonstrates the scalability of the network...
متن کاملA Programmable Dynamic Interconnection Network Router With Hidden Refresh - Circuits and Systems I: Fundamental Theory and Applications, IEEE Transactions on
A VLSI implementation of a programmable pipelined router scheme for parallel machine interconnection networks is presented in this paper. The implementation is based on a dynamic content-addressable memory (DCAM) that supports unique bit masking per entry. The number of required DCAM entries is extremely small; it is of the same order as the node degree (output ports). This, in turn, makes it p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004